870B - Maximum of Maximums of Minimums - CodeForces Solution

//AUTHOR// ABDUJALIL OD1INAEV 2008 03/01/2023
#include<bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define ll long long
#define pb push_back;
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define se second
#define fi first
double  pi=3.1415926535897932384626433832795;
///HELLOUUUUUUUU WORLD
ll fuc(ll n)
{
    ll sum=0;
    sum+=n%10;
    n/=10;
    sum+=n%10;
    n/=10;
    sum+=n%10;
    n/=10;
    sum+=n%10;
    n/=10;
    sum+=n%10;
    n/=10;
    sum+=n%10;
    n/=10;
    sum+=n%10;
    n/=10;
    sum+=n%10;
    n/=10;
    sum+=n%10;
    n/=10;
    return sum;
}
///chokadi pistacha
// rut qurut
// dafsha HAYVON
// nakuchon mashenik
// e ne
///__builtin_popcount(ar[i]^ar[b]);
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define ll long long
#define pb push_back;
#define yes cout << "YES" << endl
#define no cout << "NO" << endl 
#define se second
#define fi first
ll privet(ll a)
{
    ll mn = 10, mx = 0;
    while (a > 0)
    {
        ll d = a % 10;
        a /= 10;
        mn = min(mn,d);
        mx = max(mx,d);
    }
    return mn * mx;
}
bool salom(ll n)
{
    for (ll i = 2 ; i <= sqrt(n); i++)
    {
        if (n % i == 0)
        {
            return false;
        }
    }
    return true;
}


const ll val = (2e5) + 7;

using namespace std;
void wrongontest2()
{
    ll n,k=0;
    cin>>n>>k;
    ll ar[n];
    for (ll i = 0; i < n; i++)
    {
        cin>>ar[i];
    }
    if (k == 2)
    {
        cout << max(ar[0],ar[n-1]);
        return;
    }
    sort(ar,ar+n);
    if (k == 1)
    {
        cout << ar[0] << endl;
    }
    else
    {
        cout << ar[n-1] << endl;
    }
}
int main ()
{
    ll T=1;
    //cin >> T;
    while(T --)
    {
      wrongontest2();
    }
}